Quantifiers ∗

نویسنده

  • Michael Glanzberg
چکیده

Quantifiers are terms of generality. They are also among our prime examples of operators which take scope. The distinction between singular and general terms, as well as the ways that general terms enter into scope relations, are certainly fundamental to our understanding of language. Yet when we turn to natural language, we encounter a huge and apparently messy collection of general terms; not just every and some, but most, few, between five and ten, and many others. Natural language sentences also display a complex range of scope phenomena; unlike first-order logic, which clearly and simply demarcates scope in its notation. In spite of all this complexity, the study of quantification in natural language has made remarkable progress. Starting with a seminal trio of papers from the early 1980s, Barwise and Cooper (1981), Higginbotham and May (1981), and Keenan and Stavi (1986), quantification in natural language has been investigated extensively by philosophers, logicians, and linguists. The result has been an elegant and far-reaching theory. This chapter will present a survey of some of the important components of this theory. Section (I) will present the core of the theory of generalized quantifiers. This theory explores the range of expressions of generality in natural language, and studies some of their logical properties. Section (II) will turn to issues of how quantifiers enter into scope relations. Here there is less unanimity than in the theory of generalized quantifiers. Two basic approaches, representative of the main theories in the literature, will be sketched and compared. Finally, Section (III) will turn briefly to the general question of what a quantifier is.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING

This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...

متن کامل

On residuated lattices with universal quantifiers

We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

Characterizing Polynomial Ramsey Quantifiers

Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey quantifiers are either polynomial-time computable or NP-hard, and whether we can give a natural characterization of the polynomial-time computable quantifiers. In t...

متن کامل

Henkin and Function Quantifiers

Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...

متن کامل

More Algebras for Determiners

Some new algebras, which are possible denotations for various determiners, are studied. One of them is the algebra of generalised cardinal quantifiers which is a sub-algebra of conservative quantifiers and which contains cardinal, co-cardinal and proportional quantifiers. In addition some non-conservative quantifiers are studied (symmetric, contrapositional and fixed points with respect to the ...

متن کامل

Self-Commuting Quantifiers

We characterize the generalized quantifiers Q which satisfy the scheme QxQyφ ↔ QyQxφ, the so-called self-commuting quantifiers, or quantifiers with the Fubini property.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004